Task design for graphs: rethink multiple representations with variation theory
نویسندگان
چکیده
منابع مشابه
Designing Solvable Graphs for Multiple Moving Agents
Solvable Graphs (also known as Reachable Graphs) are types of graphs that any arrangement of a specified number of agents located on the graph’s vertices can be reached from any initial arrangement through agents’ moves along the graph’s edges, while avoiding deadlocks (interceptions). In this paper, the properties of Solvable Graphs are investigated, and a new concept in multi agent moti...
متن کاملExpander Graphs, Gonality and Variation of Galois Representations
We show that families of coverings of an algebraic curve where the associated Cayley-Schreier graphs form an expander family exhibit strong forms of geometric growth. Combining this general result with finiteness statements for rational points under such conditions, we derive results concerning the variation of Galois representations in oneparameter families of abelian varieties.
متن کاملOn cluster resource allocation for multiple parallel task graphs
Many scientific applications can be structured as Parallel Task Graphs (PTGs), that is, graphs of data-parallel tasks. Adding data-parallelism to a task-parallel application provides opportunities for higher performance and scalability, but poses additional scheduling challenges. In this paper, we study the off-line scheduling of multiple PTGs on a single, homogeneous cluster. The objective is ...
متن کاملdesigning solvable graphs for multiple moving agents
solvable graphs (also known as reachable graphs) are types of graphs that any arrangement of a specified number of agents located on the graph’s vertices can be reached from any initial arrangement through agents’ moves along the graph’s edges, while avoiding deadlocks (interceptions). in this paper, the properties of solvable graphs are investigated, and a new concept in multi agent moti...
متن کاملLearning with Multiple Representations
1. Abstract This paper reports a study which examined support the translation between multiple representations in simulation-based learning. We compared three versions of the same simulation-based learning environment: a learning environment with separated representations (control condition), a learning environment with dynamically linked representations, and a learning environment with integra...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Thinking and Learning
سال: 2020
ISSN: 1098-6065,1532-7833
DOI: 10.1080/10986065.2020.1824056